On Two-Stepwise Irregular Graphs
نویسندگان
چکیده
A graph $G$ is called irregular if the degrees of all its vertices are not same. said to be \textit{Stepwise Irregular} (SI) difference any two adjacent always 1 (one). This paper deals with \textit{2-Stepwise (2-SI) graphs in which every pair differ by 2. Here we discuss some properties 2-SI and generalize them for $k$-SI imbalance edge $k$. Besides, also compute bounds irregularity Albertson index graph.
منابع مشابه
Neighbourly Irregular Derived Graphs
A connected graph G is said to be neighbourly irregular graph if no two adjacent vertices of G have same degree. In this paper we obtain neighbourly irregular derived graphs such as semitotal-point graph, k^{tℎ} semitotal-point graph, semitotal-line graph, paraline graph, quasi-total graph and quasivertex-total graph and also neighbourly irregular of some graph products.
متن کاملOn maximally irregular graphs
Let G be a connected graph with maximum degree ∆(G). The irregularity index t(G) of G is defined as the number of distinct terms in the degree sequence of G. We say that G is maximally irregular if t(G) = ∆(G). The purpose of this note, apart from pointing out that every highly irregular graph is maximally irregular, is to establish upper bounds on the size of maximally irregular graphs and max...
متن کاملneighbourly irregular derived graphs
a connected graph g is said to be neighbourly irregular graph if no two adjacent vertices of g have same degree. in this paper we obtain neighbourly irregular derived graphs such as semitotal-point graph, k^{tℎ} semitotal-point graph, semitotal-line graph, paraline graph, quasi-total graph and quasivertex-total graph and also neighbourly irregular of some graph products.
متن کاملOn Irregular Colorings of Graphs
For a graph G and a proper coloring c : V (G) → {1, 2, . . . , k} of the vertices of G for some positive integer k , the color code of a vertex v of G (with respect to c ) is the ordered (k + 1) -tuple code(v) = (a0, a1, . . . , ak) where a0 is the color assigned to v and for 1 ≤ i ≤ k , ai is the number of vertices adjacent to v that are colored i . The coloring c is irregular if distinct vert...
متن کاملOn two-dimensional Cayley graphs
A subset W of the vertices of a graph G is a resolving set for G when for each pair of distinct vertices u,v in V (G) there exists w in W such that d(u,w)≠d(v,w). The cardinality of a minimum resolving set for G is the metric dimension of G. This concept has applications in many diverse areas including network discovery, robot navigation, image processing, combinatorial search and optimization....
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Scientia Iranica
سال: 2022
ISSN: ['1026-3098', '2345-3605']
DOI: https://doi.org/10.24200/sci.2022.57725.5388